Geometric Study on the Split Decomposition of Finite Metrics
نویسنده
چکیده
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave function, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics of splits discussed in connection to the split decomposition corresponds to the geometric properties of a hyperplane arrangement and a point configuration. By our approach, the split decomposition of metrics can be naturally extended for distance functions, which may violate the triangle inequality, using partial split distances.
منابع مشابه
A Geometric Study of the Split Decomposition
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave functions, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملCompatible decompositions and block realizations of finite metrics
Given a metric D defined on a finite set X, we define a finite collection D of metrics on X to be a compatible decomposition of D if any two distinct metrics in D are linearly independent (considered as vectors in RX×X), D = ∑ d∈D d holds, and there exist points x, x ′ ∈ X for any two distinct metrics d, d′ in D such that d(x, y) d′(x′, y) = 0 holds for every y ∈ X. In this paper, we show that ...
متن کاملA Note on Circular Decomposable Metrics
A metric d on a finite set X is called a Kalmanson metric if there exists a circular ordering of points of X , such that d(y; u) + d(z; v) > d(y; z) + d(u; v) for all crossing pairs yu and zv of . We prove that any Kalmanson metric d is an l1-metric, i.e. d can be written as a nonnegative linear combination of split metrics. The splits in the decomposition of d can be selected to form a circula...
متن کاملThe Split Decomposition of a k-Dissimilarity Map
A k-dissimilarity map on a finite set X is a function D : ( X k ) → R assigning a real value to each subset of X with cardinality k, k ≥ 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or k-semimetrics, are of interest in many areas of mathematics, computer science and classification theory, especially 2-dissimilarity maps (or distances) which are a generalisa...
متن کامل